Risk Aggregation in the presence of Discrete Causally Connected Random Variables
نویسندگان
چکیده
Risk aggregation is a popular method used to estimate the sum of a collection of financial assets or events, where each asset or event is modelled as a random variable. Applications include insurance, operational risk, stress testing, and sensitivity analysis. In practice the sum of a set of random variables involves the use of two well-known mathematical operations: n-fold convolution (for a fixed number n) and N-fold convolution, defined as the compound sum of a frequency distribution N and a severity distribution, where the number of constant n-fold convolutions is determined by N. Where the severity and frequency variables are independent, and continuous, currently numerical solutions such as, Panjer’s recursion, Fast Fourier transforms and Monte Carlo simulation produce acceptable results. However, they have not been designed to cope with new modelling challenges that require hybrid models containing discrete explanatory (regime switching) variables or where discrete and continuous variables are inter-dependent and may influence the severity and frequency in complex, non-linear, ways. This paper describes a Bayesian Factorization and Elimination (BFE) algorithm that performs convolution on the hybrid models required to aggregate risk in the presence of causal dependencies. This algorithm exploits a number of advances from the field of Bayesian Networks, covering methods to approximate statistical and conditionally deterministic functions to factorize multivariate distributions for efficient computation. Experiments show that BFE is as accurate on conventional problems as competing methods. For more difficult hybrid problems BFE can provide a more general solution that the others cannot offer. Additionally, the BFE approach can be easily extended to perform deconvolution for † Peng Lin, PhD candidate, Department of Computer Science, Queen Mary, University of London, UK, [email protected] † Martin Neil, Professor of Computer Science and Statistics, Department of Computer Science, Queen Mary, University of London, UK, [email protected] † Norman Fenton, Professor of Computer Science, Department of Computer Science, Queen Mary, University of London, UK, [email protected]
منابع مشابه
Performing Bayesian Risk Aggregation using Discrete Approximation Algorithms with Graph Factorization
Risk aggregation is a popular method used to estimate the sum of a collection of financial assets or events, where each asset or event is modelled as a random variable. Applications, in the financial services industry, include insurance, operational risk, stress testing, and sensitivity analysis, but the problem is widely encountered in many other application domains. This thesis has contribute...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملConstrained Non-Renewable Resource Allocation in Metagraphs with Discrete Random Times
In this paper, it is supposed that a project can be shown as a metagraph. The duration of activities are discrete random variables with known probability function, also one kind of consumable and constrained resource is required to execute each activity of the project.The objective of this paper is to maximize the probability of completion of stochastic metagraph before the due date of the proj...
متن کاملParameter Estimation in Spatial Generalized Linear Mixed Models with Skew Gaussian Random Effects using Laplace Approximation
Spatial generalized linear mixed models are used commonly for modelling non-Gaussian discrete spatial responses. We present an algorithm for parameter estimation of the models using Laplace approximation of likelihood function. In these models, the spatial correlation structure of data is carried out by random effects or latent variables. In most spatial analysis, it is assumed that rando...
متن کاملT-S FUZZY MODEL-BASED MEMORY CONTROL FOR DISCRETE-TIME SYSTEM WITH RANDOM INPUT DELAY
A memory control for T-S fuzzy discrete-time systems with sto- chastic input delay is proposed in this paper. Dierent from the common assumptions on the time delay in the existing literatures, it is assumed in this paper that the delays vary randomly and satisfy some probabilistic dis- tribution. A new state space model of the discrete-time T-S fuzzy system is derived by introducing some stocha...
متن کامل